全文获取类型
收费全文 | 8887篇 |
免费 | 1120篇 |
国内免费 | 343篇 |
专业分类
化学 | 797篇 |
晶体学 | 13篇 |
力学 | 1009篇 |
综合类 | 327篇 |
数学 | 5554篇 |
物理学 | 2650篇 |
出版年
2024年 | 14篇 |
2023年 | 87篇 |
2022年 | 220篇 |
2021年 | 272篇 |
2020年 | 186篇 |
2019年 | 198篇 |
2018年 | 223篇 |
2017年 | 341篇 |
2016年 | 445篇 |
2015年 | 284篇 |
2014年 | 545篇 |
2013年 | 599篇 |
2012年 | 493篇 |
2011年 | 545篇 |
2010年 | 438篇 |
2009年 | 577篇 |
2008年 | 592篇 |
2007年 | 605篇 |
2006年 | 486篇 |
2005年 | 434篇 |
2004年 | 379篇 |
2003年 | 314篇 |
2002年 | 291篇 |
2001年 | 250篇 |
2000年 | 223篇 |
1999年 | 195篇 |
1998年 | 179篇 |
1997年 | 160篇 |
1996年 | 127篇 |
1995年 | 104篇 |
1994年 | 71篇 |
1993年 | 83篇 |
1992年 | 71篇 |
1991年 | 38篇 |
1990年 | 44篇 |
1989年 | 29篇 |
1988年 | 30篇 |
1987年 | 25篇 |
1986年 | 32篇 |
1985年 | 29篇 |
1984年 | 28篇 |
1983年 | 9篇 |
1982年 | 18篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1959年 | 5篇 |
1957年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 187 毫秒
81.
人工神经网络在SARS疫情分析与预测中的应用 总被引:4,自引:0,他引:4
讨论人工神经网络在 SARS疫情分析与预测中的应用 .采用三层结构的反向传播网络 ( Backpropagation network,简称 BP网络 ) ,对 SARS在中国的传播与流行趋势及控制策略建立了网络模型 .并利用实际数据拟合参数 ,针对北京、山西的疫情进行了计算仿真 .结果表明 ,该网络模型算法收敛速度较快 ,预测精度很高 相似文献
82.
一个稳定的补偿器可同时镇定n个对象(同时强镇定)等价于一个补偿器(不一定稳定)同时镇定n 1个对象(同时镇定).两个以上对象的同时强镇定和三个以上对象的伺时镇定是线性系统中一个急待解决的公开问题.文中所作的基本假定是所有的对象具有相同的简单不稳定零点,在此条件下给出了n个对象同时强镇定的一个充分条件.当仅有一个不稳定零点时.容易检验是否同时强镇定,否则仅需确定n个对象的不稳定零点并且判定由不稳定零点导出一个相应矩阵是正定的,就能判定n个对象同时强镇定.因此是一个易于检验的充分条件.文章同时给出了n个对象同时强镇定的算法,丰富了同时强镇定的充分条件. 相似文献
83.
首先将无线传感器网络的路由问题转化成求解最小Steiner树问题,然后给出了求解无线传感器网络路由的蚁群优化算法,并对算法的收敛性进行了证明.最后对找到最优解后信息素值的变化进行了分析.即在限制信息素取值的条件下,当迭代次数充分大时,该算法能以任意接近于1的概率找到最优解,并且当最优解找到后,最优树边上的信息素单调增加,而最优解以外边上的信息素在有限步达到最小值. 相似文献
84.
In a seminal paper, Martin Clark (Communications Systems and Random Process Theory, Darlington, 1977, pp. 721–734, 1978) showed how the filtered dynamics giving the optimal estimate of a Markov chain observed in Gaussian noise can be expressed
using an ordinary differential equation. These results offer substantial benefits in filtering and in control, often simplifying
the analysis and an in some settings providing numerical benefits, see, for example Malcolm et al. (J. Appl. Math. Stoch.
Anal., 2007, to appear).
Clark’s method uses a gauge transformation and, in effect, solves the Wonham-Zakai equation using variation of constants.
In this article, we consider the optimal control of a partially observed Markov chain. This problem is discussed in Elliott
et al. (Hidden Markov Models Estimation and Control, Applications of Mathematics Series, vol. 29, 1995). The innovation in our results is that the robust dynamics of Clark are used to compute forward in time dynamics for a simplified
adjoint process. A stochastic minimum principle is established. 相似文献
85.
胡长松 《应用泛函分析学报》2007,9(2):153-157
设E是Banach空间,T∶E→2E*是极大单调算子,T-10≠ф.令x0∈E,yn=(J λnT)-1xn en,xn 1=J-1(αnJxn (1-αn)Jyn),n0,λn>0,αn∈[0,1],文章研究了{xn}收敛性. 相似文献
86.
M. H. Sadr S. Astaraki S. Salehi 《Archive of Applied Mechanics (Ingenieur Archiv)》2007,77(11):795-807
In developing a neural network technique for a finite element model updating, researchers have been shown that the number
of training samples and their quality, significantly affect the accuracy of the NN predication. In this study, based on the
genetic algorithm (GA) method, we reduce the number of analyses required to develop the training pairs and reduce the amount
of time for training the NN. In the other words, a uniform distribution of design points inside the design space will be obtained
by means of this approach. To validate the efficiency of GA sample selection, random generation (RG) method is used for comparison.
Two comparisons are made based on a numerical and experimental example. One is updated from 10 degrees of freedom lumped parameters
system and the other is updated from a free–free beam using test data. The results indicate that the GA sample selection can
reduce the number of training samples without affecting the accuracy of the NN predication. In our present study, also, the
advantages of using frequency response function (FRF) data as input to the NN are kept and the drawback of having too many
frequency points is overcome by the application of principal component analyses (PCA). 相似文献
87.
B. Ivorra A. M. Ramos B. Mohammadi 《Journal of Optimization Theory and Applications》2007,135(3):549-561
This paper has two objectives. We introduce a new global optimization algorithm reformulating optimization problems in terms
of boundary-value problems. Then, we apply this algorithm to a pointwise control problem of the viscous Burgers equation,
where the control weight coefficient is progressively decreased. The results are compared with those obtained with a genetic
algorithm and an LM-BFGS algorithm in order to check the efficiency of our method and the necessity of using global optimization
techniques. 相似文献
88.
Zhengqian Luo Guoyong Sun Zhiping Cai Miaoling Si Qibo Li 《Optics Communications》2007,277(1):118-124
In this paper, continuous wave Yb3+-doped double-clad fiber lasers (DCFLs) with linear-cavity are investigated theoretically and numerically using the rate equations. Under the steady state conditions, the simplified analytic solutions of Yb3+-doped DCFLs under considering the scattering loss are deduced in the strongly pump condition. Compared with the known analytic solutions in published literatures, our analytic solutions are more accurate, especially, at higher reflectivity of output mirror. In addition, a fast and stable algorithm based on the Newton-Raphson method is proposed to simulate numerically Yb3+-doped DCFLs. The results by simplified analytic solutions are in good agreement with those by the numerical simulation. Moreover, we have performed the optimization of an Yb3+-doped DCFL using the simplified analytic solutions and the numerical simulations, respectively. 相似文献
89.
求解最小Steiner树的蚁群优化算法及其收敛性 总被引:11,自引:0,他引:11
最小Steiner树问题是NP难问题,它在通信网络等许多实际问题中有着广泛的应用.蚁群优化算法是最近提出的求解复杂组合优化问题的启发式算法.本文以无线传感器网络中的核心问题之一,路由问题为例,给出了求解最小Steiner树的蚁群优化算法的框架.把算法的迭代过程看作是离散时间的马尔科夫过程,证明了在一定的条件下,该算法所产生的解能以任意接近于1的概率收敛到路由问题的最优解. 相似文献
90.
An energy-dependent partitioning scheme is explored for extracting a small number of eigenvalues of a real symmetric matrix with the help of genetic algorithm. The proposed method is tested with matrices of different sizes (30 × 30 to 1000 × 1000). Comparison is made with Löwdin’s strategy for solving the problem. The relative advantages and disadvantages of the GA-based method are analyzed 相似文献